Complete demodulation for automatic theorem proving

Automatic Theorem Proving in Walnut

2 Basics 3 2.1 Words and Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Number Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Automatic Words . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

Logic Control via Automatic Theorem Proving :

The COCOLOG system is a partially ordered family of rst order logical theories that describe the controlled evolution of the state of a given partially observered nite machine M. Following the review of the general theory of COCOLOG, the notion of Markovian fragments MTh k ,k 1, of full COCOLOG theories Th k is presented. These fragments enjoy the property of having axiom set of xed size over t...

Automatic Geometric Theorem Proving using Gröbner Bases

An Application of Automatic Theorem Proving inComputer

Getting accurate construction of tridimensional CAD models is a eld of great importance: with the increasing complexity of the models that modeling tools can manage nowadays, it becomes more and more necessary to construct geometrically accurate descriptions. Maybe the most promising technique, because of its full generality, is the use of automatic geometric tools: these can be used for checki...

Automatic Theorem-Proving in Combinatorics on Words

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie and Saari on the lengths of unbordered factors in the Thue-Morse sequence. Dedicated to the memory of Sheng Yu (1950–2012): friend and colleague